-
1 consistency theorem
Большой англо-русский и русско-английский словарь > consistency theorem
-
2 consistency theorem
Математика: теорема о непротиворечивости -
3 consistency theorem
-
4 joint consistency theorem
Математика: теорема о совместной непротиворечивостиУниверсальный англо-русский словарь > joint consistency theorem
-
5 joint consistency theorem
English-Russian scientific dictionary > joint consistency theorem
-
6 theorem
- analytical hierarchy theorem - arithmetical hierarchy theorem - closed range theorem - formally provable theorem - implicit function theorem - initial value theorem - integral representation theorem - local limit theorem - maximal ergodic theorem - mean value theorem - normal form theorem - ratio limit theorem - rational root theorem - second mean value theorem - theorem of consistency proofs - theorem of corresponding states - three line theorem - three series theorem - uniform convergence theorem - uniform ergodic theorem - uniform mean value theoremtheorem implies — из теоремы следует, что…
-
7 theorem on consistency proofs
Математика: теорема о доказательствах непротиворечивостиУниверсальный англо-русский словарь > theorem on consistency proofs
-
8 theorem of consistency proofs
English-Russian scientific dictionary > theorem of consistency proofs
-
9 теорема о непротиворечивости
Большой англо-русский и русско-английский словарь > теорема о непротиворечивости
-
10 pointwise
1) точечно
2) поточечный
3) точечно- ∙ pointwise approximated function ≈ точечно аппроксимированная функция pointwise asymptotic value ≈ точечное асимптотическое значение pointwise bounded function ≈ точечно ограниченная функция pointwise closed space ≈ поточечно замкнутое пространство pointwise countable family ≈ точечное счетное семейство pointwise discontinuous function ≈ точечно разрывная функция( неразрывная на плотном множестве) pointwise ergodic theorem ≈ точечная [индивидуальная] эргодическая теорема pointwise finite family ≈ точечно конечное семейство pointwise finite injective dimension ≈ точечно-конечная инъективная размерность pointwise paracompact space ≈ поточечно паракомпактное пространство topology of pointwise convergence ≈ топология поточечной сходимости - intersecting pointwise - pointwise approximation - pointwise consistency - pointwise construction - pointwise convergence - pointwise countable - pointwise differentiability - pointwise discontinuous - pointwise finite - pointwise interpretation - pointwise limit - pointwise multiplication - pointwise optimal - pointwise optimality - pointwise paracompact - pointwise topology - pointwise transitive - pointwise uniformityБольшой англо-русский и русско-английский словарь > pointwise
-
11 proof
1) доказательство; обоснование; подтверждение2) полигр. корректура, пробный оттиск4) проверка; испытание; проба || проверять; испытывать; опробовать5) безопасный; защищённый6) обеспечивать непроницаемость; герметизировать•proof against — устойчивый к воздействию (какого-л. фактора)
proof by contradiction — мат. доказательство от противного
proof by induction — мат. доказательство по индукции
proof by matrices — мат. доказательство с помощью матриц
proof in outline — набросок [схема] доказательства;
this completes the proof — это завершает доказательство; на этом доказательство заканчивается
- strong proofto give a proof — матем. дать доказательство
См. также в других словарях:
Robinson's joint consistency theorem — is an important theorem of mathematical logic. It is related to Craig interpolation and Beth definability.The classical formulation of Robinson s joint consistency theorem is as follows:Let T 1 and T 2 be first order theories. If T 1 and T 2 are… … Wikipedia
Consistency — For other uses, see Consistency (disambiguation). In logic, a consistent theory is one that does not contain a contradiction.[1] The lack of contradiction can be defined in either semantic or syntactic terms. The semantic definition states that a … Wikipedia
Theorem — The Pythagorean theorem has at least 370 known proofs[1] In mathematics, a theorem is a statement that has been proven on the basis of previously established statements, such as other theorems, and previously accepted statements … Wikipedia
Gentzen's consistency proof — Gentzen s theoremIn 1936 Gerhard Gentzen proved the consistency of first order arithmetic using combinatorial methods. Gentzen s proof shows much more than merely that first order arithmetic is consistent. Gentzen showed that the consistency of… … Wikipedia
Proof sketch for Gödel's first incompleteness theorem — This article gives a sketch of a proof of Gödel s first incompleteness theorem. This theorem applies to any formal theory that satisfies certain technical hypotheses which are discussed as needed during the sketch. We will assume for the… … Wikipedia
Löwenheim–Skolem theorem — In mathematical logic, the Löwenheim–Skolem theorem, named for Leopold Löwenheim and Thoralf Skolem, states that if a countable first order theory has an infinite model, then for every infinite cardinal number κ it has a model of size κ. The… … Wikipedia
Fluctuation theorem — The fluctuation theorem (FT) is a theorem from statistical mechanics dealing with the relative probability that the entropy of a system which is currently away from thermodynamic equilibrium (maximum entropy) will increase or decrease over a… … Wikipedia
Paris–Harrington theorem — In mathematical logic, the Paris–Harrington theorem states that a certain combinatorial principle in Ramsey theory is true, but not provable in Peano arithmetic. This was the first natural example of a true statement about the integers that could … Wikipedia
CAP-Theorem — Das CAP Theorem oder Brewer s Theorem besagt, dass es für ein System zum verteilten Rechnen unmöglich ist, gleichzeitig die drei Eigenschaften Konsistenz, Verfügbarkeit und Partitionstoleranz zu garantieren.[1][2] Inhaltsverzeichnis 1… … Deutsch Wikipedia
Cox's theorem — Cox s theorem, named after the physicist Richard Threlkeld Cox, is a derivation of the laws of probability theory from a certain set of postulates. This derivation justifies the so called logical interpretation of probability. As the laws of… … Wikipedia
Gödel's completeness theorem — is a fundamental theorem in mathematical logic that establishes a correspondence between semantic truth and syntactic provability in first order logic. It was first proved by Kurt Gödel in 1929. A first order formula is called logically valid if… … Wikipedia